Nested Conceptual Graphs for Information Fusion Traceability
نویسندگان
چکیده
InSyTo is a toolbox of algorithms for information fusion and query relying on the conceptual graphs formalism subgraph isomorphism search. was used in order to develop many applications different domains. Although framework several application domain well received by end-users, they highlighted an urgent need traceability within process. We propose here improvement toolbox, embed feature inside algorithm. The underlying graph representation extended from basic Nested Typed Graphs. A lineage nested added each concept initial graph, that contains it’s processing history through steps. concerning sources elementary item (concept), as operations were applied them. main advantage this new development capacity having trustworthy aware current observed situation, interpretations build situation observations coming sources. In paper, after presenting context our work, we recall approach functionalities. then define proposed matter handling.
منابع مشابه
Positive Nested Conceptual Graphs
This paper deals with positive (i.e. without negation) nested conceptual graphs (NCGs). We first give a general framework graphs of graphs provided with morphism for defining classes of NCGs. Then we define a new class of NCGs typed NCGs and we show that known kinds of NCGs can be described very simply as classes of the general framework. All NCG models considered generalize the simple CG model...
متن کاملInformation Fusion using Conceptual Graphs: a TV Programs Case Study
On the one hand, Conceptual Graphs are widely used in natural language processing systems. On the other hand, information fusion community lacks of tools and methods for knowledge representation. Using natural language processing techniques for information fusion is a new field of interest in the fusion community. Our aim is to take the advantage of both communities and propose a framework for ...
متن کاملA Traceability Conjecture for Oriented Graphs
A (di)graph G of order n is k-traceable (for some k, 1 ≤ k ≤ n) if every induced sub(di)graph of G of order k is traceable. It follows from Dirac’s degree condition for hamiltonicity that for k ≥ 2 every k-traceable graph of order at least 2k − 1 is hamiltonian. The same is true for strong oriented graphs when k = 2, 3, 4, but not when k ≥ 5. However, we conjecture that for k ≥ 2 every k-tracea...
متن کاملConceptual Graphs For Representing Conceptual Structures
A conceptual graph (CG) is a graph representation for logic based on the semantic networks of artificial intelligence and the existential graphs of Charles Sanders Peirce. CG design principles emphasize the requirements for a cognitive representation: a smooth mapping to and from natural languages; an “iconic” structure for representing patterns of percepts in visual and tactile imagery; and co...
متن کاملSpatial Information Fusion: Coping with Uncertainty in Conceptual Structures
A logical formalism associating properties to space parcels in so-called attribute formulas, is proposed. Properties are related through the axioms of a taxonomy graph, and parcels through a partonomy graph. Attributive formulas establish relations between parcels and properties, and we use them to align different taxonomies, over a compatible partonomy, using Formal Concept Analysis. We discus...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Lecture Notes in Computer Science
سال: 2021
ISSN: ['1611-3349', '0302-9743']
DOI: https://doi.org/10.1007/978-3-030-86982-3_2